Comparing Optimal Relocation Operations With Simulated Relocation Policies in One-Way Carsharing Systems

Relocation in Carsharing Systems Using Flows in Time-Expanded Networks

Optimal timing of relocation

In this paper we tackle the problem of the optimal relocation policy for a firm that faces two types of uncertainty: one about the moments in which new (and more efficient) sites will become available; and the other regarding the degree of efficiency improvement inherent to each one of these new, yet to be known, potential location places. In particular, we derive results concerning the expecte...

Toward User-Based Relocation Information Systems in Station-Based One-Way Car Sharing

Car sharing is an important mobility service to approach urban and suburban mobility problems. It is a sustainable means of transport because it lowers the emissions of each car sharing customer by substituting privately owned vehicles by joint used ones. Nevertheless, car sharing still has to fully unfold its potential and has to overcome certain obstacles. For instance, it is necessary to sub...

Two Flow-Based Approaches for the Static Relocation Problem in Carsharing Systems

In a carsharing system, a fleet of cars is distributed at stations in an urban area, customers can take and return cars at any time and station. For operating such a system in a satisfactory way, the stations have to keep a good ratio between the numbers of free places and cars in each station. This leads to the problem of relocating cars between stations, which can be modeled within the framew...

On Relocation Decision Policies of Mobile Databases

Recently, mobile computing has received much attention from database community. Sharing information among mobile users is one of the most challenging issues in mobile computing due to user mobility. Replication is a promising technique to this issue. However, adopting replication into mobile computing is a non-trivial task, since we are still facing other problems such as the lack in disk capac...